Product Gauss cubature over polygons based on Green’s integration formula
نویسندگان
چکیده
منابع مشابه
Gauss-Green cubature over spline curvilinear polygons
We have implemented in Matlab a Gauss-like cubature formula over bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of the domain,...
متن کاملAn algebraic cubature formula on curvilinear polygons
We implement in Matlab a Gauss-like cubature formula on bivariate domains whose boundary is a piecewise smooth Jordan curve (curvilinear polygons). The key tools are Green’s integral formula, together with the recent software package chebfun to approximate the boundary curve close to machine precision by piecewise Chebyshev interpolation. Several tests are presented, including some comparisons ...
متن کاملPolynomial interpolation and cubature over polygons
We have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type) on convex or concave polygons, together with the corresponding interpolatory cubature formulas. The method works by QR and LU factorizations of rectangular Vandermonde matrices on Weakly Admissible Meshes (WAMs) of polygons, constructed by polygon quadrangulation. 2000 AMS subject classification: 65D05...
متن کاملOn Product Integration with Gauss-kronrod Nodes
Gauss-Kronrod product quadrature formulas for the numerical approximation of R 1 ?1 k(x)f (x)dx are shown to converge for every Riemann integrable f , and to possess optimal stability. Similar results are proved for the product formulas based on the Kronrod nodes only. An application to the uniform convergence of approximate solutions of integral equations is given.
متن کاملGauss-Green cubature and moment computation over arbitrary geometries
We have implemented in Matlab a Gauss-like cubature formula over arbitrary bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn2 nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2007
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-007-0131-2